On near-critical and dynamical percolation in the tree case
نویسندگان
چکیده
Consider independent bond percolation with retention probability p on a spherically symmetric tree Γ. Write θΓ(p) for the probability that the root is in an infinite open cluster, and define the critical value pc = inf{p : θΓ(p) > 0}. If θΓ(pc) = 0, then the root may still percolate in the corresponding dynamical percolation process at the critical value pc, as demonstrated recently by Häggström, Peres and Steif. Here we relate this phenomenon to the near-critical behaviour of θΓ(p) by showing that the root percolates in the dynamical percolation process if and only if ∫ 1 pc (θΓ(p)) dp < ∞. The “only if” direction extends to general trees, whereas the “if” direction fails in this generality.
منابع مشابه
The scaling limit of the Minimal Spanning Tree — a preliminary report
This is a brief description of how the recent proof of the existence and conformal covari-ance of the scaling limits of dynamical and near-critical planar percolation implies the existence and several topological properties of the scaling limit of the Minimal Spanning Tree, and that it is invariant under scalings, rotations and translations. However, we do not expect conformal invariance: we ex...
متن کاملDynamical Percolation on General Trees
Häggström, Peres, and Steif (1997) have introduced a dynamical version of percolation on a graph G. When G is a tree they derived a necessary and sufficient condition for percolation to exist at some time t. In the case that G is a spherically symmetric tree, Peres and Steif (1998) derived a necessary and sufficient condition for percolation to exist at some time t in a given target set D. The ...
متن کاملLocal time on the exceptional set of dynamical percolation, and the Incipient Infinite Cluster
In dynamical critical site percolation on the triangular lattice or bond percolation on Z , we define and study a local time measure on the exceptional times at which the origin is in an infinite cluster. We show that at a typical time with respect to this measure, the percolation configuration has the law of Kesten’s Incipient Infinite Cluster. In the most technical result of this paper, we sh...
متن کامل2 00 4 Self - Organized Forest - Fires near the Critical Time
We consider a forest-fire model which, somewhat informally, is described as follows: Each site (vertex) of the square lattice is either vacant or occupied by a tree. Vacant sites become occupied at rate 1. Further, each site is hit by lightning at rate λ. This lightning instantaneously destroys (makes vacant) the occupied cluster of the site. This model is closely related to the Drossel-Schwabl...
متن کاملJa n 20 09 IS THE CRITICAL PERCOLATION PROBABILITY LOCAL ?
We show that the critical probability for percolation on a d-regular nonamenable graph of large girth is close to the critical probability for percolation on an infinite d-regular tree. This is a special case of a conjecture due to O. Schramm on the locality of pc. We also prove a finite analogue of the conjecture for expander graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 15 شماره
صفحات -
تاریخ انتشار 1999